On finitely generated profinite groups, I: strong completeness and uniform bounds

نویسنده

  • Nikolay Nikolov
چکیده

We prove that in every finitely generated profinite group, every subgroup of finite index is open; this implies that the topology on such groups is determined by the algebraic structure. This is deduced from the main result about finite groups: let w be a ‘locally finite’ group word and d ∈ N. Then there exists f = f(w, d) such that in every d-generator finite group G, every element of the verbal subgroup w(G) is equal to a product of f w-values. An analogous theorem is proved for commutators; this implies that in every finitely generated profinite group, each term of the lower central series is closed. The proofs rely on some properties of the finite simple groups, to be established in Part II.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower Bounds for Representation Growth

This article examines lower bounds for the representation growth of finitely generated (particularly profinite and pro-p) groups. It also considers the related question of understanding the maximal multiplicities of character degrees in finite groups, and in particular simple groups.

متن کامل

Elementary Equivalence and Profinite Completions: a Characterization of Finitely Generated Abelian-by-finite Groups

In this paper, we show that any finitely generated abelian-byfinite group is an elementary submodel of its profinite completion. It follows that two finitely generated abelian-by-finite groups are elementarily equivalent if and only if they have the same finite images. We give an example of two finitely generated abelian-by-finite groups G, H which satisfy these properties while G x Z and H x Z...

متن کامل

Rational Codes and Free Profinite Monoids

It is well known that clopen subgroups of finitely generated free profinite groups are again finitely generated free profinite groups. Clopen submonoids of free profinite monoids need not be finitely generated nor free. Margolis, Sapir and Weil proved that the closed submonoid generated by a finite code (which is in fact clopen) is a free profinite monoid generated by that code. In this note we...

متن کامل

Modular Representations of Profinite Groups

Our aim is to transfer several foundational results from the modular representation theory of finite groups to the wider context of profinite groups. We are thus interested in profinite modules over the completed group algebra k[[G]] of a profinite group G, where k is a finite field of characteristic p. We define the concept of relative projectivity for a profinite k[[G]]-module. We prove a cha...

متن کامل

ELEMENTARY EQUIVALENCE OF PROFINITE GROUPS by

There are many examples of non-isomorphic pairs of finitely generated abstract groups that are elementarily equivalent. We show that the situation in the category of profinite groups is different: If two finitely generated profinite groups are elementarily equivalent (as abstract groups), then they are isomorphic. The proof applies a result of Nikolov and Segal which in turn relies on the class...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008